Variable-Weighted Grayscale Centroiding and Accuracy Evaluating
نویسندگان
چکیده
منابع مشابه
compactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولColor-to-grayscale conversion through weighted multiresolution channel fusion
We present a color-to-gray conversion algorithm that retains both the overall appearance and the discriminability of details of the input color image. The algorithm employs a weighted pyramid image fusion scheme to blend the R, G, and B color channels of the input image into a single grayscale image. The use of simple visual quality metrics as weights in the fusion scheme serves to retain visua...
متن کاملWeighted Factors for Evaluating Anonymity
Many systems provide anonymity for their users, and most of these systems work on the separation between the users’ identity and the final destination. The level of anonymity these services provide is affected by several factors, some of which are related to the design of the anonymity service itself. Others are related to how the system is used or the user’s application/purpose in using the an...
متن کاملEvaluating CDCL Variable Scoring Schemes
The VSIDS (variable state independent decaying sum) decision heuristic invented in the context of the CDCL (conflict-driven clause learning) SAT solver Chaff, is considered crucial for achieving high efficiency of modern SAT solvers on application benchmarks. This paper proposes ACIDS (average conflict-index decision score), a variant of VSIDS. The ACIDS heuristics is compared to the original i...
متن کاملWeighted Graph Based Decision High Accuracy Acoust
In this paper, a novel weighted graph based decision tree optimization algorithm is proposed. The graph is a compact representation of most possible solutions for the decision tree based classifications. The optimal decision tree is then be extracted from it using the N-level prediction technique. The prediction technique can incorporate future knowledge about classifications based on the tree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mechanical Engineering
سال: 2013
ISSN: 1687-8140,1687-8140
DOI: 10.1155/2013/428608